Limited Computation

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Smodels System with Limited Lookahead Computation

We describe an answer-set programming solver smodels−, derived from smodels by eliminating some lookahead computations. We show that for some classes of programs smodels− outperforms smodels and demonstrate the computational potential of our approach.

متن کامل

Key Establishment Protocol for Computation-limited Devices

This paper present a new protocol based on symmetric encryption, which has quasi-forward secrecy and resistance to quasi-key compromise impersonation. It is a protocol suitable for computation-limited devices. Also by blinding the long-term key, we make the attack to long-term key harder.We have done the theoretical analysis and will finish the simulation and implementation.

متن کامل

Bargaining with limited computation: Deliberation equilibrium

We develop a normative theory of interaction—negotiation in particular—among self-interested computationally limited agents where computational actions are game theoretically treated as part of an agent’s strategy. We focus on a 2-agent setting where each agent has an intractable individual problem, and there is a potential gain from pooling the problems, giving rise to an intractable joint pro...

متن کامل

Lower Bounds for Computation with Limited Nondeterminism

We investigate the e ect of limiting the number of available nondeterministic bits in di erent computational models. First we relate formula size to one-way communication complexity and derive lower bounds of (n = log n) on the size of formulae with n = log n nondeterministic bits for 0 < 1=2. Next we prove a rounds-communication hierarchy for communication complexity with limited nondeterminis...

متن کامل

Sensor Scheduling Algorithms Requiring Limited Computation

In this paper, we consider the scenario where many sensors co-operate to estimate a process. Only one sensor can take a measurement at any time step. We wish to come up with optimal sensor scheduling algorithms. The problem is motivated by the use of sonar range-finders used by the vehicles on the Caltech Multi-Vehicle Wireless Testbed. We see that this problem involves searching a tree in gene...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ICGA Journal

سال: 1993

ISSN: 2468-2438,1389-6911

DOI: 10.3233/icg-1993-16219